Equilibrium points in polymatrix games
نویسندگان
چکیده
منابع مشابه
Equilibrium Points in N - Person Games
* This note arose from consultations during the tenure of a John Simon Guggenheim Memorial Fellowship by MacLane. ' Whitehead, J. H. C., "Combinatorial Homotopy I and II," Bull. A.M.S., 55, 214-245 and 453-496 (1949). We refer to these papers as CH I and CH II, respectively. ' By a complex we shall mean a connected CW complex, as defined in §5 of CH I. We do not restrict ourselres to finite com...
متن کاملEquilibrium Points in N-Person Games.
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive o...
متن کاملApproximating Nash Equilibria in Tree Polymatrix Games
We develop a quasi-polynomial time Las Vegas algorithm for approximating Nash equilibria in polymatrix games over trees, under a mild renormalizing assumption. Our result, in particular, leads to an expected polynomial-time algorithm for computing approximate Nash equilibria of tree polymatrix games in which the number of actions per player is a fixed constant. Further, for trees with constant ...
متن کاملComputing Constrained Approximate Equilibria in Polymatrix Games
This paper is about computing constrained approximate Nash equilibria in polymatrix games, which are succinctly represented manyplayer games defined by an interaction graph between the players. In a recent breakthrough, Rubinstein showed that there exists a small constant ǫ, such that it is PPAD-complete to find an (unconstrained) ǫ-Nash equilibrium of a polymatrix game. In the first part of th...
متن کاملConstrained Pure Nash Equilibria in Polymatrix Games
We study the problem of checking for the existence of constrained pure Nash equilibria in a subclass of polymatrix games defined on weighted directed graphs. The payoff of a player is defined as the sum of nonnegative rational weights on incoming edges from players who picked the same strategy augmented by a fixed integer bonus for picking a given strategy. These games capture the idea of coord...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lithuanian Mathematical Journal
سال: 1968
ISSN: 2669-1973
DOI: 10.15388/lmj.1968.20224